Random Walks with Local Memory

نویسندگان

چکیده

We prove a quenched invariance principle for class of random walks in environment on $${\mathbb {Z}}^d$$ , where the walker alters its own environment. The consists an outgoing edge from each vertex. updates e at current location to new $$e'$$ (whose law depends e) and then steps other endpoint . show that native these (i.e., is stationary time perspective walker) wired uniform spanning forest oriented toward walker, plus independent walker.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Good Local Bounds for Simple Random Walks

We give a local central limit theorem for simple random walks on Z, including Gaussian error estimates. The detailed proof combines standard large deviation techniques with Cramér-Edgeworth expansions for lattice distributions. A simple random walk on Z is a sequence of independent identically distributed random variables (steps) on Z. We here suppose that the steplength is bounded, that is, th...

متن کامل

Parrondo-like behavior in continuous-time random walks with memory.

The continuous-time random walk (CTRW) formalism can be adapted to encompass stochastic processes with memory. In this paper we will show how the random combination of two different unbiased CTRWs can give rise to a process with clear drift, if one of them is a CTRW with memory. If one identifies the other one as noise, the effect can be thought of as a kind of stochastic resonance. The ultimat...

متن کامل

Random Walks with Random Projections

Random projections have been widely used for dimensionality reduction of high dimensional problems. In this paper we show how to compute some popular random walk based proximity measures (hitting and commute times, personalized pagerank) using random projections in undirected graphs. A number of important graph-based real world applications such as image segmentation, collaborative filtering in...

متن کامل

Random walks with random velocities.

We consider a random walk model that takes into account the velocity distribution of random walkers. Random motion with alternating velocities is inherent to various physical and biological systems. Moreover, the velocity distribution is often the first characteristic that is experimentally accessible. Here, we derive transport equations describing the dispersal process in the model and solve t...

متن کامل

Random Walks with Few Random Generators

Let G be a nite group. Choose a set S of size k uniformly from G and consider a lazy random walk on the corresponding Cayley graph. We show that for almost all choices of S given k = 2 a log 2 jGj, a > 1, this walk mixes in under m = 2a log a a?1 log jGj steps. A similar result was obtained earlier by Alon and Roichman (see AR]), Dou and Hildebrand (see DH]) using a diierent techniques. We also...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Physics

سال: 2021

ISSN: ['0022-4715', '1572-9613']

DOI: https://doi.org/10.1007/s10955-021-02791-5